In-Place Planar Convex Hull Algorithms
نویسندگان
چکیده
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others. . .
منابع مشابه
Fast Randomized Parallel Methods for Planar Convex Hull Construction
We present a number of eecient parallel algorithms for constructing 2-dimensional convex hulls on a randomized CRCW PRAM. Speciically, we show how to build the convex hull of n pre-sorted points in the plane in O(1) time using O(n log n) work, with n-exponential probability, or, alternately, in O(log n) time using O(n) work, with n-exponential probability. We also show how to nd the convex hull...
متن کاملOn the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm"
The output-sensitive “ultimate planar convex hull algorithm” of Kirkpatrick and Seidel [16] recently has been shown by Afshani et al. [1] to be instance-optimal. We revisit this algorithm with a focus on space-efficiency and prove that it can be implemented as an in-place algorithm, i.e., using O(1) working space.
متن کاملSpace-efficient planar convex hull algorithms
A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set.
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA First Algorithm: Planar Convex Hulls
We will start with a simple geometric problem, the computation of the convex hull of a finite set of points in the plane. We will formulate a basic algorithm that constructs the planar hull in quadratic time. It accesses the input points through a single predicate, the orientation predicate for three points. We will see how this predicate can be realized by a simple formula in the point coordin...
متن کامل